System and Method for Computing a Probability that an Object Comprises a Target

ABSTRACT

A method for computing a probability that an object comprises a target includes: performing a scan of an area comprising the object, generating points; creating a segment corresponding to the object using the points as segment points, the segment extending from a first segment point to a last segment point, the segment comprising a plurality of the segment points; and applying a metric, computing the probability that the object comprises the target.

SUMMARY

This invention relates in general to a system and method for computing aprobability that an object comprises a target.

A method for computing a probability that an object comprises a targetincludes: performing a scan of an area, generating points; creating asegment corresponding to the object using the points as segment points,the segment extending from a first segment point to a last segmentpoint; and applying a metric, computing the probability that the segmentcomprises the target.

A method for computing a probability that an object comprises a targetincludes: performing a scan of an area, generating points; creating asegment corresponding to the object using the points as segment points,the segment extending from a first segment point to a last segmentpoint, the segment comprising a plurality of the segment points; addingthe segment to a candidate set of lines; for at least one segment point,computing a point-segment distance from the point to the segment;determining that the point-segment distance is not less than a thresholddistance; finding a farthest point that comprises the point that isfarthest from the segment; and updating a metric usable to compute theprobability that the object comprises the target.

A method for computing a probability that an object comprises a targetincludes: performing a scan of an area, generating points; creating asegment corresponding to the object using the points as segment points,the segment extending from a first segment point to a last segmentpoint, the segment comprising a plurality of the segment points; addingthe segment to a candidate set of lines; for at least one segment point,computing a point-segment distance from the point to the segment;determining that the point-segment distance is less than a thresholddistance; and updating a metric usable to compute the probability thatthe object comprises the target.

A method for computing a probability that an object comprises a targetincludes: creating a segment corresponding to the object, the segmentextending from a first segment point to a last segment point, thesegment comprising a plurality of segment points, using points obtainedin a scan of an area comprising the segment; adding the segment to acandidate set of lines; for at least one segment point, computing apoint-segment distance from the point to the segment; determining thatthe point-segment distance is not less than a threshold distance;finding a farthest point that comprises the point that is farthest fromthe segment; separating the segment points in the segment into a firstgroup of adjacent segment points and a second group of adjacent segmentpoints, with the farthest point being the only segment point in commonbetween the first group and the second group, the farthest point beingdefined as the last segment point for the first group, the farthestpoint also being defined as the first segment point for the secondgroup; and removing the segment from a candidate set of lines.

A method for computing a probability that an object comprises a targetincludes: creating a segment corresponding to the object, the segmentextending from a first segment point to a last segment point, thesegment comprising a plurality of segment points, using points obtainedin a scan of an area comprising the segment; adding the segment to acandidate set of lines; for at least one segment point, computing apoint-segment distance from the point to the segment; and determiningthat the point-segment distance is less than a threshold distance.

A method for computing a probability that an object comprises a targetincludes: creating a segment corresponding to the object, the segmentextending from a first segment point to a last segment point, thesegment comprising a plurality of segment points, using points obtainedin a scan of an area situated in an environment of a robot, the areacomprising the segment; adding the segment to a candidate set of lines;for at least one segment point, computing a point-segment distance fromthe point to the segment; determining that the point-segment distance isnot less than a threshold distance; finding a farthest point thatcomprises the point that is farthest from the segment; separating thesegment points in the segment into a first group of adjacent segmentpoints and a second group of adjacent segment points, with the farthestpoint being the only segment point in common between the first group andthe second group, the farthest point being defined as the last segmentpoint for the first group, the farthest point also being defined as thefirst segment point for the second group; removing the segment from acandidate set of lines; identifying the segment as one or more of targetand non-target, wherein the identifying step comprises a sub-step of:training the system to improve the classification performance, whereinthe training sub-step comprises sub-sub-steps of: determining that anenvironment is empty of targets; driving the robot through thetarget-free environment so that the system learns that objects in thetarget-free environment are not targets; driving the robot through anenvironment comprising a target; collecting data regarding a location ofthe target; obtaining information on the location of the target from atag configured to track the location of the target, the target wearing avest comprising the tag; and correlating the data against theinformation.

DESCRIPTION OF THE DRAWINGS

FIG. 1 is a flowchart of a method for computing a probability that anobject comprises a target.

FIGS. 2A-2D are a set of drawings showing how the method for computing aprobability that an object comprises a target is applied to a cornerthat the system identifies as non-target.

FIGS. 3A-3E are a set of drawings showing how the method for computing aprobability that an object comprises a target is applied to a cornerthat the system identifies as target.

FIG. 4 is a flowchart of a method for computing a probability that anobject comprises a target.

FIG. 5 is a flowchart of a method for computing a probability that anobject comprises a target.

FIG. 6 is a flowchart of a method for computing a probability that anobject comprises a target.

FIG. 7 is a flowchart of a method for computing a probability that anobject comprises a target.

DETAILED DESCRIPTION

While the present invention is susceptible of embodiment in manydifferent forms, there is shown in the drawings and will herein bedescribed in detail one or more specific embodiments, with theunderstanding that the present disclosure is to be considered asexemplary of the principles of the invention and not intended to limitthe invention to the specific embodiments shown and described. In thefollowing description and in the several figures of the drawings, likereference numerals are used to describe the same, similar orcorresponding parts in the several views of the drawings.

The system includes a plurality of components such as one or more ofelectronic components, hardware components, and computer softwarecomponents. A number of such components can be combined or divided inthe system. An example component of the system includes a set and/orseries of computer instructions written in or implemented with any of anumber of programming languages, as will be appreciated by those skilledin the art.

The system in one example employs one or more computer-readablesignal-bearing media. The computer-readable signal bearing media storesoftware, firmware and/or assembly language for performing one or moreportions of one or more implementations of the invention. Thecomputer-readable signal-bearing medium for the system in one examplecomprises one or more of a magnetic, electrical, optical, biological,and atomic data storage medium. For example, the computer-readablesignal-bearing medium comprises one or more of floppy disks, magnetictapes, CD-ROMs, DVD-ROMs, hard disk drives, downloadable files, filesexecutable “in the cloud,” electronic memory, and anothercomputer-readable signal-bearing medium.

Any logic or application described herein, including but not limited tothe server-side master application, the server-side customizationapplication, and the server-side streaming application that comprisessoftware or code can be embodied in any non-transitory computer-readablemedium for use by or in connection with an instruction execution systemsuch as, for example, a server-side processor in a computer system orother system. In this sense, the logic may comprise, for example,statements including instructions and declarations that can be fetchedfrom the computer-readable medium and can be executed by the instructionexecution system. In the context of the present disclosure, acomputer-readable medium can be any medium that can contain, store, ormaintain the logic or application described herein for use by or inconnection with the instruction execution system. For example, thecomputer-readable medium may comprise one or more of random accessmemory (RAM), read-only memory (ROM), hard disk drive, solid-statedrive, USB flash drive, memory card, floppy disk, optical disc such ascompact disc (CD) or digital versatile disc (DVD), magnetic tape, andother memory components. For example, the RAM may comprise one or moreof static random access memory (SRAM), dynamic random access memory(DRAM), magnetic random access memory (MRAM), and other forms of RAM.For example, the ROM may comprise one or more of programmable read-onlymemory (PROM), erasable programmable read-only memory (EPROM),electrically erasable programmable read-only memory (EEPROM), and otherforms of ROM.

For example, the target comprises one or more of a human, a humanappendage, a robot, a robot appendage, a forklift, a wall, a cart, ashelf, a chair, another object, and another target. According toembodiments of the invention, a minimum number of lines is determined tocomprise all points in a segment. According to further embodiments ofthe invention, the minimum number of lines is determined to comprise allpoints in a scan segment. For example, a shelf leg typically requirestwo lines. For example, a human leg requires more than two lines becauseit is rounder than a shelf leg.

FIG. 1 is a flowchart of a method 100 for computing a probability thatan object comprises a target. For example, the method 100 classifies theobject as target or non-target. The order of the steps in the method 100is not constrained to that shown in FIG. 1 or described in the followingdiscussion. Several of the steps could occur in a different orderwithout affecting the final result.

In step 110, the system performs a scan of an area comprising a point inan environment, generating points. For example, the area is situated inan environment of a robot. For example, the environment comprises anenvironment of a robot. For example, the scan comprises a laser scan.For example, the scan comprises one or more of a robot and an object inthe environment of the robot. For example, the object comprises one ormore of a human appendage, a robotic appendage, a robot, a wall, a cart,a forklift, a shelf, a chair, and another object. For example, the humanappendage comprises one or more of a human arm, a human leg, and anotherhuman appendage. For example, the robotic appendage comprises one ormore of a robot arm, a robot leg, and another robotic appendage. Block110 then transfers control to block 120.

In step 120, the system creates a segment corresponding to the object.For example, the system divides the points into segments. For example,the robot comprises a processor that divides the scan data. For example,a server comprises the processor. For example, a segment comprises atleast two segment points. For example, the segment extends from a firstsegment point to a last segment point. For example, the segment pointsare close to each other. For example, the segment points are within aEuclidean distance of each other. For example, the Euclidean distance isspecified by a user. For example, the processor calculates the Euclideandistance on the fly.

For example, the number of segments is approximately equal to the numberof points. For example, the number of segments is exactly equal to thenumber of points. For example, the segments are divided using analgorithm that assesses one or more of the location of points missingfrom the limb and the importance of the missing point. For example, thesegments into which the area is divided can be created whenever twoadjacent points are separated by a distance greater than a predeterminedlength. For example, the segments into which the area is divided can becreated whenever the two adjacent points are separated by a distancegreater than six centimeters (6 cm).

For example, a segment corresponds to an object in the environment. Forexample, a segment comprises the object. For example, the objectcomprises the segment. For example, the object comprises one or more ofan object in the environment and a portion of an object in theenvironment. For example, a segment comprises one or more of a humanappendage, a robotic appendage, a robot, a wall, a cart, a forklift, ashelf, a chair, and another object in the environment. For example, asegment comprises a portion of one or more of a human appendage, arobotic appendage, a robot, a wall, a cart, a forklift, a shelf, achair, and another object in the environment.

Block 120 then transfers control to one or more of blocks 130A, 130B . .. 130F (as shown). The number of segments is not limited to any specificnumber; the example shown uses six segments.

In steps 130A-130F, for at least one segment, a classifier computes aprobability that a segment comprises a target. The probability iscalculated using one or more metrics configured to help determinewhether a segment comprises the object. For example, the metriccomprises a point-segment distance from the point to the segment. Forexample, the computing step is performed for each segment point. Forexample, the system compares the distance from a point to a segment toone or more threshold distances to determine whether the point-segmentdistance is less than the threshold distance. The system can thereforeestimate whether the object comprises the segment. For example, thethreshold distance roughly expresses the amount of deviation from astraight line that is acceptable in order for the line to still bedefined as straight within the noise level limits of the sensor beingused.

For example, the metric comprises one or more of the point-segmentdistance from the point to the segment, a number of lines needed tocover points in the segment, a number of lines needed to cover allpoints in the segment to within a threshold distance, a best fit linearregression to the segment, a best fit circular approximation to thesegment, and another metric. For example, after computing the best fitcircular approximation to the segment, the processor compares the radiusof the best fit circular approximation to one or more of a minimumexpected circle and a maximum expected circle. One or more of theminimum expected circle and the maximum expected circle are calculatedusing an expected limb position. For example, the expected limb positionis calculated. For example, the expected limb position is predesignatedby a user.

For example, the processor computes a maximum distance between twopoints in the segment. For example, the processor then compares thecomputed maximum distance to a maximum threshold distance. For example,the maximum threshold distance is calculated. For example, the maximumthreshold distance is predesignated by the user.

For example, the classifier uses information from more than one scan,such as the velocity estimate of a segment based on the best matchingsegment from the previous scan. For example, the best matching segmentcomprises the segment that is closest in Euclidean distance from theprevious scan. For example, the best matching segment comprises thesegment that is closest based on the previously scanned position of thesegment and after applying the estimated velocity of the previous scanmultiplied by the time increment since the previous scan. For example,the classifier comprises an estimate of whether the segment is locatedinside an obstacle known to the robot from a pre-defined map. Forexample, the classifier comprises an estimate of whether the segment islocated inside a shelf known to the robot from a pre-defined map. Blocks130A-130F then transfer control to respective blocks 140A-140F.

In steps 140A-140F, for at least one of the one or more segments, usingthe classifier, the system determines a likelihood that a segmentcomprises an object. For example, the system uses machine learningtechniques to determine the likelihood. For example, the machinelearning techniques comprise one or more of data from a previous scan.For example, the data from a previous scan comprises a likelihood that asegment comprises a target. For example, the system uses machinelearning techniques to determine the likelihood that a segment comprisesa target.

Preferably, although not necessarily, for each of the one or moresegments, the processor applies a classifier to determine whether thesegment comprises an object. If the classifier determines that thesegment comprises the object, a filter uses the segment to compute theprobability that the object comprises the target.

For example, for at least one segment, the classifier makes a bimodaldetermination that the segment comprises the limb. Alternatively, oradditionally, the classifier computes a probability that the segmentcomprises the limb. For example, for each segment, the classifier makesa bimodal determination that the segment comprises the limb. Blocks140A-140F then transfer control to respective blocks 150A-150F.

In steps 150A-150F, the segment is associated with a filter. Forexample, the filter is near to the segment. For example, the segment isassociated with more than one filter. Blocks 150A-150F then transfercontrol to respective blocks 160A-160F.

In steps 160A-160F, a segment that does not have a high likelihood ofcomprising the object is discarded. For example, a segment that is notdeemed to comprise the human leg is not used with the filters in thecurrent iteration. The low likelihood segment may optionally be savedand used in a future iteration to reduce a likelihood of an observationcomprising a human leg.

For each of the lines examined by the system, the line is compared tothe candidate set. If it is within a threshold distance of a line withinthe candidate set, then the line is not added to the candidate set, butthe system adds an index of the point as a point that is covered by theline already in the candidate set. If the line cannot be covered by amember of the candidate set, then the line is added to the candidate setalong with the indices of the points forming the line. The thresholddistance will depend on the scanner used, and can be one of the trainedsystem parameters.

Once the set of candidate lines has been found, the system determinesthe minimum number of lines such that all points are covered.

FIGS. 2A-2D are a set of drawings showing how the method for computing aprobability that an object comprises a target is applied to a cornerthat the system identifies as non-target. The corner-identifying featurefinds a minimum set of lines that can be used to cover all points in asegment 200.

In FIG. 2A, a laser scanner scans the environment, generating a segment200. As depicted in FIG. 2A, the laser scanner scans from left to right.The segment 200 comprises nine points, a first point 205, a second point210, a third point 215, a fourth point 220, a fifth point 225, a sixthpoint 230, a seventh point 235, an eighth point 240, and a ninth point245. The endpoints of the segment 200 are the first point 205 in thelaser scan, which may also be referred to as a first endpoint 205, andthe ninth point 245, which is the last point in the laser scan and whichmay also be referred to as a second endpoint 245.

In FIG. 2B, the system draws a first line 250 that connects the firstendpoint 205 to the second endpoint 245. The first line 250 becomes thefirst member of a candidate set of lines generated by the system incomputing a probability that a corner comprises a target.

For at least one of the other points besides the first endpoint 205 andthe second endpoint 245, the system compares the first line 250 to thepoint. For example, the system compares the second point 210 to thefirst line 250. If the system determines that the second point 210 has afirst distance 255 from the first line 250 of less than a thresholddistance 260, then a line to the second point 210 is not added to thecandidate set, but the system records the second point 210 as a point210 that is covered by the existing candidate set. As depicted, thethreshold distance 260 may be visualized as a thickness of the firstline 250. The threshold distance 260 is predetermined by a user.Alternatively, or additionally, the system calculates the thresholddistance 260 on the fly. The threshold distance 260 may depend on thescanner used by the system. The threshold distance 260 is a parameterthat is trained by the classifier.

As shown in FIG. 2C, if the system determines that the second point 210has a first distance 255 from the first line 250 of greater than orequal to the threshold distance 260, the system removes the first line250 from the candidate set. The system then finds a farthest point thatcomprises a point that is farthest from the line 250. As depicted here,the system finds that the fifth point 225 is the farthest point 225.

The system then creates a second line 265 running from the firstendpoint 205 to the farthest point 225. The system creates a third line267 running from the farthest point 225 to the second endpoint 245. Thesystem adds the second line 265 to the candidate set along with theindices of the points forming the second line 265, that is, the systemadds the indices of the first endpoint 205 and of the farthest point225. The system also adds the third line 267 to the candidate set alongwith the indices of the points forming the third line 267, that is, thesystem adds the indices of the farthest point 225 and of the secondendpoint 245.

The system determines whether a second distance of the second point 210from the second line 265 is less than the threshold distance 260. Thesystem determines that the second point 210 has a second distance fromthe second line 265 of less than the threshold distance 260.

The system then proceeds to the third point 215 and determines whether athird distance of the third point 215 from the second line 265 is lessthan the threshold distance 260. The system determines that the thirdpoint 215 has a third distance from the second line 265 of less than thethreshold distance 260.

The system then proceeds to the fourth point 220 and determines whethera fourth distance of the fourth point 220 from the second line 265 isless than the threshold distance 260. The system determines that thefourth point 220 has a fourth distance from the second line 265 of lessthan the threshold distance 260.

The system then proceeds to the fifth point 225 and determines whether afifth distance of the fifth point 225 from the second line 265 is lessthan the threshold distance 260. The system determines that the fifthpoint 225 trivially has a fifth distance from the second line 265 ofzero and therefore of less than the threshold distance 260.

The system then proceeds to the sixth point 230 and determines whether asixth distance of the sixth point 230 from the third line 267 is lessthan the threshold distance 260. The system determines that the sixthpoint 230 has a sixth distance from the second line 265 of less than thethreshold distance 260.

The system then proceeds to the seventh point 235 and determines whethera seventh distance of the seventh point 235 from the third line 267 isless than the threshold distance 260. The system determines that theseventh point 235 has a seventh distance from the second line 265 ofless than the threshold distance 260.

The system then proceeds to the eighth point 240 and determines whetheran eighth distance of the eighth point 240 from the third line 267 isless than the threshold distance 260. The system determines that theeighth point 240 has an eighth distance from the second line 265 of lessthan the threshold distance 260.

The system then proceeds to the second endpoint 245. The systemdetermines that the second endpoint 245 trivially has a ninth distancefrom the third line 267 of zero and therefore of less than the thresholddistance 260. In fact, as depicted, the second endpoint 245 triviallyhas a ninth distance from the third line 267 of zero and therefore ofless than the threshold distance 260. The system then terminates theprocess.

In FIG. 2D, the dotted lines indicating the width of the thresholddistance (object 260 in FIGS. 2B-2C) are removed. Also the intermediatepoints (in FIGS. 2A-2C, points 210, 215, 220, 230, 235, and 240) areremoved. What remains are the second line 265, the third line 267, thefirst and second endpoints 205 and 245, and the farthest point 225.

The system uses the number of candidate lines needed to cover all pointsin the segment as a factor used to compute a probability that an objectcomprises a target. The system can use training as part of theclassifier in determining a number of acceptable lines in the coveringset. A human appendage such as a human leg has a high number of lines,for example approximately six lines or more whereas corners, such asthose found on shelves and posts will have few lines, for example,approximately two lines.

Optionally, the method includes an additional step, performed after theremoving step, of identifying the segment as one or more of target andnon-target. The identifying step may include using a number of candidatelines needed to cover all points in the segment as a factor in theidentifying. The identifying step may include identifying the segment asone or more of comprising a target and not comprising a target.

The identifying step may include one or more of associating a highernumber of needed candidate lines with a segment comprising a target andassociating a lower number of needed candidate lines with a segment notcomprising a target. The identifying step may include using one or moreof Adaboost, a decision tree, a neural network, and another classifier.The identifying step may include a sub-step of training the system toimprove the classification performance.

Optionally, the method may include a step, performed after theidentifying step, of filtering the segment to integrate theclassification with knowledge about one or more of locations of targetsand locations of non-targets. The filtering step may include a sub-stepof performing data association between a classified human appendage anda known location of a human. The filtering step may include using one ormore of a particle filter, an Extended Kalman Filter (EKF), and anotherfilter.

FIGS. 3A-3E are a set of drawings showing how the method for computing aprobability that an object comprises a target is applied to a cornerthat the system identifies as target. The corner-identifying featurefinds a minimum set of lines that can be used to cover all points in asegment 300.

In FIG. 3A, a laser scanner scans the environment, generating a segment300. As depicted in FIG. 3A, the laser scanner scans from left to right.The segment 300 comprises nine points, a first point 305, a second point310, a third point 315, a fourth point 320, a fifth point 325, a sixthpoint 330, a seventh point 335, an eighth point 340, and a ninth point345. The endpoints of the segment 300 are the first point 305 in thelaser scan, which may also be referred to as a first endpoint 305, andthe ninth point 345, which is the last point in the laser scan and whichmay also be referred to as a second endpoint 345.

In FIG. 3B, the system draws a first line 350 that connects the firstendpoint 305 to the second endpoint 345. The first line 350 becomes thefirst member of a candidate set of lines generated by the system incomputing a probability that a corner comprises a target.

For at least one of the other points besides the first endpoint 305 andthe second endpoint 345, the system compares the first line 350 to thepoint. For example, the system compares the second point 310 to thefirst line 350. If the system determines that the second point 310 has afirst distance 355 from the first line 350 of less than a thresholddistance 360, then a line to the second point 310 is not added to thecandidate set, but the system records the second point 310 as a point310 that is covered by the existing candidate set. As depicted, thethreshold distance 360 may be visualized as a thickness of the firstline 350. The threshold distance 360 is predetermined by a user.Alternatively, or additionally, the system calculates the thresholddistance 360 on the fly. The threshold distance 360 may depend on thescanner used by the system. The threshold distance 360 is a parameterthat is trained by the classifier.

As shown in FIG. 3C, if the system determines that the second point 310has a first distance 355 from the first line 350 of greater than orequal to the threshold distance 360, the system removes the first line350 from the candidate set. The system then finds a farthest point thatcomprises a point that is farthest from the line 350. As depicted here,the system finds that the fifth point 325 is the first farthest point325.

The system then creates a second line 365 running from the firstendpoint 305 to the first farthest point 325. The system creates a thirdline 367 running from the first farthest point 325 to the secondendpoint 345. The system adds the second line 365 to the candidate setalong with the indices of the points forming the second line 365, thatis, the system adds the indices of the first endpoint 305 and of thefirst farthest point 325. The system also adds the third line 367 to thecandidate set along with the indices of the points forming the thirdline 367, that is, the system adds the indices of the first farthestpoint 325 and of the second endpoint 345.

The system then proceeds to the third point 315 and determines whether athird distance of the third point 315 from the second line 365 is lessthan the threshold distance 360.

The system determines that the second point 310 has a third distance 370from the second line 365 of greater than or equal to the thresholddistance 360.

The system determines that the sixth point 330 has a sixth distance 372from the third line 367 of greater than or equal to the thresholddistance 360.

As shown in FIG. 3D, after the system determines that the second point310 has a third distance 370 from the second line 365 of greater than orequal to the threshold distance 360, the system removes the second line365 from the candidate set.

After the system determines that the sixth point 330 has a sixthdistance 372 from the third line 367 of greater than or equal to thethreshold distance 360, the system removes the second line 365 from thecandidate set.

The system then finds a second farthest point that is farthest from thesecond line 365. As depicted here, the system finds that the third point315 is the second farthest point 315.

The system then creates a fourth line 375 running from the firstendpoint 305 to the second farthest point 315. The system creates afifth line 377 running from the second farthest point 315 to the firstfarthest point 325. The system adds the fourth line 375 to the candidateset along with the indices of the points forming the fourth line 375,that is, the system adds the indices of the first endpoint 305 and ofthe second farthest point 315. The system also adds the fifth line 377to the candidate set along with the indices of the points forming thefifth line 377, that is, the system adds the indices of the secondfarthest point 315 and of the first farthest point 325.

The system then finds a third farthest point that is farthest from thethird line 367. As depicted here, the system finds that the seventhpoint 335 is the third farthest point 335.

The system then creates a fourth line 375 running from the firstendpoint 305 to the second farthest point 315. The system creates afifth line 377 running from the second farthest point 315 to the firstfarthest point 325. The system adds the fourth line 375 to the candidateset along with the indices of the points forming the fourth line 375,that is, the system adds the indices of the first endpoint 305 and ofthe second farthest point 315. The system also adds the fifth line 377to the candidate set along with the indices of the points forming thefifth line 377, that is, the system adds the indices of the secondfarthest point 315 and of the first farthest point 325.

The system then creates a sixth line 378 running from the first farthestpoint 325 to the third farthest point 335. The system creates a seventhline 380 running from the third farthest point 335 to the secondendpoint 345.

The system determines whether a distance of the second point 310 fromthe fourth line 375 is less than the threshold distance 360. The systemdetermines that the second point 310 has a distance from the fourth line375 of less than the threshold distance 360.

The system then proceeds to the third point 315 and determines whether athird distance of the third point 315 from the fourth line 375 is lessthan the threshold distance 360. The system determines that the thirdpoint 315 trivially has a third distance from the fourth line 375 ofzero and therefore of less than the threshold distance 360.

The system then proceeds to the fourth point 320 and determines whethera fourth distance of the fourth point 320 from the fifth line 377 isless than the threshold distance 360. The system determines that thefourth point 320 has a fourth distance from the fifth line 377 of lessthan the threshold distance 360.

The system then proceeds to the fifth point 325 and determines whether athird distance of the fifth point 325 from the fifth line 377 is lessthan the threshold distance 360. The system determines that the fifthpoint 325 trivially has a distance from the fifth line 377 of zero andtherefore of less than the threshold distance 360.

The system then proceeds to the sixth point 330 and determines whether asixth distance of the sixth point 330 from the sixth line 378 is lessthan the threshold distance 360. The system determines that the sixthpoint 330 has a sixth distance from the sixth line 378 of less than thethreshold distance 360.

The system then proceeds to the seventh point 335 and determines whethera seventh distance of the seventh point 335 from the sixth line 378 isless than the threshold distance 360. The system determines that theseventh point 335 trivially has a distance from the sixth line 378 ofzero and therefore of less than the threshold distance 360.

The system then proceeds to the eighth point 340 and determines whetheran eighth distance of the eighth point 340 from the seventh line 380 isless than the threshold distance 360. The system determines that theeighth point 340 has an eighth distance from the seventh line 380 ofless than the threshold distance 360.

The system then proceeds to the second endpoint 345 and determineswhether a ninth distance of the second endpoint 345 from the seventhline 380 is less than the threshold distance 360. The system determinesthat the second endpoint 345 trivially has a distance from the seventhline 380 of zero and therefore of less than the threshold distance 360.The system then terminates the process.

In FIG. 3E, the dotted lines indicating the width of the thresholddistance (object 360 in FIGS. 3B-3D) are removed. Also the intermediatepoints (in FIGS. 3A-3C, points 310, 315, 320, 330, 335, and 340) areremoved. What remains are the second line 365, the third line 375, thefirst and second endpoints 305 and 345, and the first farthest point325.

The metrics used, and the thresholds used, may be automatically trainedfrom sample data using algorithms such as Adaboost, decision trees,neural networks, or another classifier. For example, training can bedone in two stages to improve classification performance: 1) collectingscans that have no objects of interest by driving the robot (eitherautonomously or under human control) through an environment that isempty of objects of interest. For example, scans that have no human legsare collected by driving the robot through an environment that is emptyof human legs. Negative data is thereby generating training the systemregarding objects that are not human legs. 2) The second batch of datais collected by having a human wear a vest comprising a tag configuredto track a location of the human. The scan data is then correlatedagainst information on the location of the human obtained from the tag.For example, the tag comprises one or more of an augmented reality (AR)tag, a radio frequency identification (RFID) tag, and another tag.

After each scan has been segmented and classified, a filter may be runon individual leg candidates to track their movement from scan to scan.This provides a means to estimate a value from a model of expectedmovement and expected sensor readings. For example, the filter comprisesone or more of a particle filter, an Extended Kalman Filter (EKF), andanother filter. The filter provides a means to integrate knowledge aboutone or more of locations of targets and locations of non-targets withthe new information generated by the classification.

After the leg candidates have been tracked, a filter may do dataassociation between legs and the human. Each filter will approximate onepotential human, who can be paired with at most two candidate legs.

To improve classification, it is possible to remove a segment thatcorresponds to a non-moving object. Alternatively, or additionally, asegment that corresponds to a non-moving object is removed as part offiltering. One method to do this is, when filtering, to consult a mapthat indicates where these non-moving objects of interest are located,so as to perform one or more of reducing a weight accorded to suchnon-moving objects and completely removing the non-moving object. Forexample, the map can be generated using one or more of simultaneouslocalization and mapping (SLAM) and another mapping method.Alternatively, a costmap can be used to reduce a weight of non-movingobjects of interest, allowing the factoring into the classifier'scalculation of likely cost as a function of distance. Such a stepreduces the odds of known things like shelves, tables, walls, and thelike from being detected as legs.

Optionally, the method includes an additional step, performed after theremoving step, of computing a probability that the segment comprises thetarget. The identifying step may includes using a number of candidatelines needed to cover all points in the segment as a factor in theidentifying. The identifying step may include identifying the segment asone or more of comprising the target and not comprising the target.

The identifying step may include one or more of associating a highernumber of needed candidate lines with a segment comprising a target andassociating a lower number of needed candidate lines with a segment notcomprising a target. The identifying step may include using one or moreof Adaboost, a decision tree, a neural network, and another classifier.The identifying step may include a sub-step of training the system toimprove the classification performance.

Optionally, the method may include a step, performed after theidentifying step, of filtering the segment to integrate theclassification with knowledge about one or more of locations of targetsand locations of non-targets. The filtering step may include a sub-stepof performing data association between a classified human appendage anda known location of a human. The filtering step may include using one ormore of a particle filter, an Extended Kalman Filter (EKF), and anotherfilter.

FIG. 4 is a flowchart of a method 400 for computing a probability thatan object comprises a target. The order of the steps in the method 400is not constrained to that shown in FIG. 4 or described in the followingdiscussion. Several of the steps could occur in a different orderwithout affecting the final result.

In step 410, the system performs a scan of an area comprising an object,generating points. Block 410 then transfers control to block 420.

In step 420, the system creates a segment corresponding to the objectusing the points as segment points, the segment extending from a firstsegment point to a last segment point, the segment comprising aplurality of the segment points. Block 420 then transfers control toblock 430.

In step 430, applying a metric, the system computes the probability thatthe segment comprises the target. Block 430 then terminates the process.Alternatively, or additionally, block 430 loops back to block 410 andthe process begins again.

FIG. 5 is a flowchart of a method 500 for computing a probability thatan object comprises a target. The order of the steps in the method 500is not constrained to that shown in FIG. 5 or described in the followingdiscussion. Several of the steps could occur in a different orderwithout affecting the final result.

In step 510, the system performs a scan of an area, generating points.Block 510 then transfers control to block 520.

In step 520, the system creates a segment corresponding to the objectusing the points as segment points, the segment extending from a firstsegment point to a last segment point, the segment comprising aplurality of the segment points. Block 520 then transfers control toblock 530.

In step 530, the system adds the segment to a candidate set of lines.Block 530 then transfers control to block 540.

In step 540, for at least one segment point, the system computes apoint-segment distance from the point to the segment. Block 540 thentransfers control to block 550.

In step 550, the system queries if the point-segment distance is lessthan a threshold distance. If yes, the system proceeds to step 560. Ifno, the system terminates the process.

In step 560, the system finds a farthest point that comprises a pointthat is farthest from the segment. Block 560 then transfers control toblock 570.

In step 570, the system updates a metric usable to compute theprobability that the object comprises the target. Block 570 thenterminates the process.

FIG. 6 is a flowchart of a method 600 for computing a probability thatan object comprises a target. The order of the steps in the method 600is not constrained to that shown in FIG. 6 or described in the followingdiscussion. Several of the steps could occur in a different orderwithout affecting the final result.

In step 610, the system creates a segment corresponding to an object,the segment extending from a first segment point to a last segmentpoint, the segment comprising a plurality of segment points, usingpoints obtained in a scan of an area comprising the segment. Block 610then transfers control to block 620.

In step 620, the system adds the segment to a candidate set of lines.Block 620 then transfers control to block 630.

In step 630, for at least one segment point, the system computes apoint-segment distance from the point to the segment. Block 630 thentransfers control to block 640.

In step 640, the system queries if the point-segment distance is lessthan a threshold distance. If yes, the system proceeds to step 650. Ifno, the system terminates the process.

In step 650, the system finds a farthest point that comprises a pointthat is farthest from the segment. Block 650 then transfers control toblock 655.

In step 660, the system separates the segment points in the segment intoa first group of adjacent segment points and a second group of adjacentsegment points, with the farthest point being the only segment point incommon between the first group and the second group, the farthest pointbeing defined as the last segment point for the first group, thefarthest point also being defined as the first segment point for thesecond group. Block 660 then transfers control to block 670.

In step 670, the system removes the segment from a candidate set oflines. Block 670 then terminates the process.

FIG. 7 is a flowchart of a method 700 for computing a probability thatan object comprises a target. The order of the steps in the method 700is not constrained to that shown in FIG. 7 or described in the followingdiscussion. Several of the steps could occur in a different orderwithout affecting the final result.

In step 710, the system creates a segment corresponding to an object,the segment extending from a first segment point to a last segmentpoint, the segment comprising a plurality of segment points, usingpoints obtained in a scan of an area comprising the segment. Block 710then transfers control to block 720.

In step 720, the system adds the segment to a candidate set of lines.Block 720 then transfers control to block 730.

In step 730, for at least one segment point, the system computes apoint-segment distance from the point to the segment. Block 730 thentransfers control to block 740.

In step 740, the system queries if the point-segment distance is lessthan a threshold distance. If yes, the system proceeds to step 750. Ifno, the system terminates the process.

In step 750, the system finds a farthest point that comprises a pointthat is farthest from the segment. Block 750 then transfers control toblock 760.

In step 760, the system separates the segment points in the segment intoa first group of adjacent segment points and a second group of adjacentsegment points, with the farthest point being the only segment point incommon between the first group and the second group, the farthest pointbeing defined as the last segment point for the first group, thefarthest point also being defined as the first segment point for thesecond group. Block 760 then transfers control to block 770.

In step 770, the system removes the segment from a candidate set oflines. Block 770 then transfers control to block 780.

In step 780, the system identifies the segment as one or more of targetand non-target, wherein the identifying step comprises a sub-step of:training the system to improve the classification performance, whereinthe training sub-step comprises sub-sub-steps of: determining that anenvironment is empty of targets; driving the robot through thetarget-free environment so that the system learns that objects in thetarget-free environment are not targets; driving the robot through anenvironment comprising a target; collecting data regarding a location ofthe target; obtaining information on the location of the human from atag configured to track the location of the human, the human wearing avest comprising the tag; and correlating the data against theinformation. Block 780 then terminates the process.

Once an object has been classified as a human, the system can set thehuman as a goal, and the system can plan a path for the robot to thegoal using a motion planner. The planning goal represents the set ofstates we want to reach in order to find a valid path. For example, thesystem can use one or more of a search-based planner, a sampling-basedplanner, an optimization based planner, and another planner. The robot'sposition can be represented by its location and spatial orientation (x,y, 8). The system can plan to move the robot from the initial systemstate to a goal state that corresponds to a position behind the human.For a search-based planner, the system applies motion primitives tosuccessive states, expanding only the best states. A motion primitive isdefined as a small motion that can be composed to move the robot. Forexample, a motion primitive comprises an instruction to do one or moreof drive straight, turn 180 degrees, turn 10 degrees counterclockwise,drive a given distance, and the like.

At a given point in the planning, the system determines the best stateusing a heuristic. For example, the heuristic comprises one or more of aEuclidean distance, an A* search algorithm, a Manhattan distance, andanother heuristic. For example, to ensure that the robot sees the human,we can constrain the planner by imposing a visibility constraint. Forexample, the system may implement the visibility constraint by requiringthat a straight line from the robot sensor origin reach the humanwithout passing through an obstacle. This visibility constraint willforce the planner to plan paths where robot can always see the human,and can also factor in other moving targets and known static targetsthat may occlude its view during the motion.

Advantages of embodiments of the invention include facilitating a rapidand accurate determination as to whether an appendage is human ornon-human, enabling an effective “follow pick” order fulfillment systemin which a robot follows a human. Embodiments of the invention eliminateor reduce the likelihood of a robot mistakenly concluding that anon-human object is human.

For example, it will be understood by those skilled in the art thatsoftware used by the system and method for order fulfillment andinventory management using robots may be located in any location inwhich it may be accessed by the system. It will be further understood bythose of skill in the art that the number of variations of the network,location of the software, and the like are virtually limitless. Forexample, the threshold distance may vary for the different lines. It isintended, therefore, that the subject matter in the above descriptionshall be interpreted as illustrative and shall not be interpreted in alimiting sense.

While the above representative embodiments have been described withcertain components in exemplary configurations, it will be understood byone of ordinary skill in the art that other representative embodimentscan be implemented using different configurations and/or differentcomponents. For example, it will be understood by one of ordinary skillin the art that the order of certain steps and certain components can bealtered without substantially impairing the functioning of theinvention.

The representative embodiments and disclosed subject matter, which havebeen described in detail herein, have been presented by way of exampleand illustration and not by way of limitation. It will be understood bythose skilled in the art that various changes may be made in the formand details of the described embodiments resulting in equivalentembodiments that remain within the scope of the invention. It isintended, therefore, that the subject matter in the above descriptionshall be interpreted as illustrative and shall not be interpreted in alimiting sense.

1-10. (canceled)
 11. A method for computing a probability that an objectcomprises a target, comprising: using a computer, using segment pointsobtained in a scan of an area comprising a segment, the segmentcomprising a plurality of segment points, creating a line correspondingto the object, the line extending from a first segment point to a lastsegment point; using the computer, adding the line to a candidate set oflines; using the computer, for at least one segment point, computing apoint-line distance from the point to the line; using the computer,determining that the point-line distance is less than a thresholddistance; using the computer, finding a farthest point that comprisesthe point that is farthest from the line; using the computer, separatingthe segment points in the segment into a first group of adjacent segmentpoints and a second group of adjacent segment points, with the farthestpoint being the only segment point in common between the first group andthe second group, the farthest point being defined as the last segmentpoint for the first group, the farthest point also being defined as thefirst segment point for the second group; and using the computer,removing the line from a candidate set of lines.
 12. The method of claim11, wherein the area is situated in an environment of a robot.
 13. Themethod of claim 11, wherein the computing step is performed for eachsegment point.
 14. The method of claim 11, wherein the step ofseparating comprises dividing the points into the first group and thesecond group using an algorithm that assesses one or more of a locationof a point missing from the object and an importance of the missingpoint.
 15. The method of claim 11, wherein the step of separatingcomprises dividing the points into the first group and the second groupwhenever two adjacent points are separated by a distance greater than anapproximate predetermined length.
 16. The method of claim 11, whereinthe segment comprises one or more of a human appendage, a roboticappendage, a robot, a wall, a cart, a forklift, a shelf, a chair, andanother object in the environment.
 17. The method of claim 11, whereinthe computing step comprises computing, for each segment, apoint-segment distance from the point to the segment.
 18. The method ofclaim 11, wherein the threshold distance comprises one or more of aminimum expected circle and a maximum expected circle.
 19. The method ofclaim 11, wherein the step of determining comprises receiving athreshold distance that is predetermined by a user.
 20. The method ofclaim 11, wherein the step of determining comprises computing athreshold distance on the fly.
 21. The method of claim 11, comprising anadditional step, performed after the removing step, of: identifying thesegment as one or more of target and non-target.
 22. The method of claim21, wherein the identifying step comprises using a number of candidatelines needed to cover all points in the segment as a factor in theidentifying.
 23. The method of claim 21, wherein the identifying stepcomprises identifying the segment as one or more of comprising a targetand not comprising a target.
 24. The method of claim 21, wherein theidentifying step comprises one or more of associating a higher number ofneeded candidate lines with a segment comprising a target andassociating a lower number of needed candidate lines with a segment notcomprising a target.
 25. The method of claim 21, wherein the identifyingstep comprises using one or more of Adaboost, a decision tree, a neuralnetwork, and another classifier. 26-28. (canceled)
 29. The method ofclaim 11, wherein the adding step comprises adding an index of a pointforming the segment.
 30. The method of claim 29, wherein the adding stepcomprises adding indices of each point forming the segment. 31-38.(canceled)
 39. The method of claim 21, wherein the identifying stepcomprises a sub-step of: training the system to improve theclassification performance.
 40. The method of claim 39, wherein thetraining sub-sub-step comprises sub-sub-steps of: determining that anenvironment is empty of targets; driving the robot through thetarget-free environment so that the system learns that objects in thetarget-free environment are not targets; driving the robot through anenvironment comprising a target; collecting data regarding a location ofthe target; obtaining information on the location of the human from atag configured to track the location of the human; and correlating thedata against the information.
 41. The method of claim 40, wherein thesub-sub-step of driving through the target-free environment comprisesone or more of driving the robot autonomously and driving the robotunder human control.
 42. The method of claim 40, wherein the tagcomprises one or more of an augmented reality (AR) tag, a radiofrequency identification (RFID) tag, and another tag.
 43. The method ofclaim 40, wherein the sub-sub-step of correlating comprises correlatingthe data against information obtained by a human wearing a vestcomprising the tag.
 44. (canceled)
 45. A method for computing aprobability that an object comprises a target, comprising: using acomputer, using segment points obtained in a scan of an area situated inan environment of a robot, the area comprising the segment, the robotcomprising a segment, the segment comprising a plurality of segmentpoints, creating a line corresponding to the object, the line extendingfrom a first segment point to a last segment point; using the computer,adding the line to a candidate set of lines; using the computer, for atleast one segment point, computing a point-line distance from the pointto the line; using the computer, determining that the point-linedistance is less than a threshold di stance using the computer, findinga farthest point that comprises the point that is farthest from theline; using the computer, separating the segment points in the segmentinto a first group of adjacent segment points and a second group ofadjacent segment points, with the farthest point being the only segmentpoint in common between the first group and the second group, thefarthest point being defined as the last segment point for the firstgroup, the farthest point also being defined as the first segment pointfor the second group; using the computer, removing the line from acandidate set of lines using the computer, for at least one segmentpoint, computing a point-segment distance from the point to the segment;using the computer, determining that the point-segment distance is notless than a threshold distance; using the computer, finding a farthestpoint that comprises the point that is farthest from the segment; usingthe computer, separating the segment points in the segment into a firstgroup of adjacent segment points and a second group of adjacent segmentpoints, with the farthest point being the only segment point in commonbetween the first group and the second group, the farthest point beingdefined as the last segment point for the first group, the farthestpoint also being defined as the first segment point for the secondgroup; using the computer, removing the segment from a candidate set oflines; and using the computer, identifying the segment as one or more oftarget and non-target, wherein the identifying step comprises a sub-stepof: using the computer, training the system to improve theclassification performance, wherein the training sub-step comprisessub-sub-steps of: using the computer, determining that an environment isempty of targets; using the computer, driving the robot through thetarget-free environment so that the system learns that objects in thetarget-free environment are not targets; using the computer, driving therobot through an environment comprising a target; using the computer,collecting data regarding a location of the target; using the computer,obtaining information on the location of the human from a tag configuredto track the location of the human, the human wearing a vest comprisingthe tag; and using the computer, correlating the data against theinformation.